First established the minimum transmission cost model in online multicast data transmission network, given the concept of efficient presenting set of spanning tree, and presented an algorithm to generate one efficient presenting set with time complexity O ( mlogen). 首先建立了数据传输网络选择的最小成本模型,给出了有效支撑树代表集的概念,并给出了一个时间复杂性为O(mlogen)的算法产生代表集。
The quickest path problem is to find a path to send data from the source to the destination with minimum transmission time. 最快路是在最短的时间内把信息从源发送到目的端的路。
When the time is expressed as a function of various data rates, the optimum set of data rates for concurrent user groups to achieve minimum transmission time can be derived. 对于多媒体业务,当我们让传输时间是可变数据速率的函数时,该方案即可找出当前用户组的最优数据速率集,以使系统的传输时间最小。
The approach of calculating the optimum set of data rates and the minimum transmission time is presented and proved. For various traffic conditions, we proposed dynamic resource allocation schemes according to various QoS requirements and the number of users. 文中给出并证明了计算最优速率集和对应最小传输时间的方法,归纳了当系统中业务变化时,根据变化的QoS要求和用户数目进行动态资源分配的流程。